public class BinaryTree {

    static class TreeNode {
        public char val;
        public TreeNode left;//左孩子的引用
        public TreeNode right;//右孩子的引用

        public TreeNode(char val) {
            this.val = val;
        }
    }


    /**
     * 创建一棵二叉树 返回这棵树的根节点
     *
     * @return
     */
    public TreeNode createTree() {

    }

    // 前序遍历
    public void preOrder(TreeNode root) {
    }

    // 中序遍历
    void inOrder(TreeNode root) {
    }

    // 后序遍历
    void postOrder(TreeNode root) {
    }

    public static int nodeSize;

    void size(TreeNode root) {
    }

    int size2(TreeNode root) {
    }

    public static int leafSize = 0;

    void getLeafNodeCount1(TreeNode root) {
    }

    int getLeafNodeCount2(TreeNode root) {
    }

    int getKLevelNodeCount(TreeNode root, int k) {
    }

    int getHeight(TreeNode root) {

    }

    TreeNode find(TreeNode root, char val) {

        return null;
    }

    //层序遍历
    void levelOrder(TreeNode root) {

    }


    // 判断一棵树是不是完全二叉树
    boolean isCompleteTree(TreeNode root) {
        return true;
    }
}
public class Text {
    public static void main(String[] args) {

    }
}
